Meshfree generalized finite difference methods in soil mechanics—part I: theory
نویسندگان
چکیده
منابع مشابه
Minimal Positive Stencils in Meshfree Finite Difference Methods for the Poisson Equation
Meshfree finite difference methods for the Poisson equation approximate the Laplace operator on a point cloud. Desirable are positive stencils, i.e. all neighbor entries are of the same sign. Classical least squares approaches yield large stencils that are in general not positive. We present an approach that yields stencils of minimal size, which are positive. We provide conditions on the point...
متن کاملMeshfree Methods in Option Pricing Meshfree Methods in Option Pricing
A meshfree approximation scheme based on the radial basis function methods is presented for the numerical solution of the options pricing model. This thesis deals with the valuation of the European, Barrier, Asian, American options of a single asset and American options of multi assets. The option prices are modeled by the Black-Scholes equation. The θ-method is used to discretize the equation ...
متن کاملMultiplicative Finite Difference Methods
Based on multiplicative calculus, the finite difference schemes for the numerical solution of multiplicative differential equations and Volterra differential equations are presented. Sample problems were solved using these new approaches.
متن کاملFinite Difference Methods
In this notes, we summarize numerical methods for solving Stokes equations on rectangular grid, and solve it by multigrid vcycle method with distributive Gauss-Seidel relaxation as smoothing. The numerical methods we concerned are MAC scheme, nonconforming rotate bilinear FEM and nonconforming rotate bilinear FVM. 1. PROBLEM STATEMENT We consider Stokes equation (1.1) 8 >< >: μ ~ u +rp =~ f in ...
متن کاملFinite Difference Methods
1 STATEMENT OF THE PROBLEM Our goal is to introduce how derivatives can be approximated by using difference quotients. Suppose we have an interval [a,b] ⊂ R. Let a = x0 < x1 < ·· · < xN−1 < xN = b be a partition. We call {x1, . . . , xN−1} the interior points, and {x0, xN } the boundary. Given a function f : [a,b] → R, we want to approximate the derivative f ′ using our partition. 2 DIFFERENCE ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: GEM - International Journal on Geomathematics
سال: 2013
ISSN: 1869-2672,1869-2680
DOI: 10.1007/s13137-013-0048-7